Evaluating Polynomials at Fixed Sets of Points
نویسندگان
چکیده
منابع مشابه
Evaluating Polynomials at Fixed Sets of Points
We investigate the evaluation of an (n-1)st degree polynomial at a sequence of n points. It is shown that such an evaluation reduces directly to a simple convolution if and only if the sequence of points is of the form b, ba, ba2, ., ba for complex numbers a and b (the so-called "chirp transform"). By more complex reductions we develop an O(n log n) evaluation algorithm for sequences of points ...
متن کاملEvaluating Polynomials at Many Points
Polynomi~ evaluation is one of the most frecpuent-Iy aocurring tasks iF numerical co .nputitions, In fact, many algorithms entail the evaluation of oue or more polynomials at a large number of values. The purpose of &is note, is to reflect on this evaluation problem, more from a theoreticai than practical point of view. ally, we are interested in the number of basic arithmetics (+,-9 X , +) req...
متن کاملOn Sets, Types, Fixed Points, and Checkerboards
Most current research on automated theorem proving is concerned with proving theorems of first-order logic. We discuss two examples which illustrate the advantages of using higher-order logic in certain contexts. For some purposes type theory is a much more convenient vehicle for formalizing mathematics than axiomatic set theory. Even theorems of first-order logic can sometimes be proven more e...
متن کاملComputing Least Fixed Points of Probabilistic Systems of Polynomials
We study systems of equations of the form X1 =f1(X1, . . .,Xn), . . . ,Xn = fn(X1, . . . ,Xn) where each fi is a poly-nomial with nonnegative coefficients that add up to 1. The leastnonnegative solution, say μ, of such equation systems is central toproblems from various areas, like physics, biology, computational lin-guistics and probabilistic program verification. W...
متن کاملFixed Points of the Dickson Polynomials of the Second Kind
The permutation behavior of Dickson polynomials of the first kind has been extensively studied, while such behavior for Dickson polynomials of the second kind is less known. Necessary and sufficient conditions for a polynomial of the second kind to be a permutation over some finite fields have been established by Cohen, Matthew, and Henderson. We introduce a new way to define these polynomials ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 1975
ISSN: 0097-5397,1095-7111
DOI: 10.1137/0204045